Weighted Means in Stochastic Approximation of Minima∗
نویسنده
چکیده
Weighted averages of Kiefer–Wolfowitz-type procedures, which are driven by larger step lengths than usual, can achieve the optimal rate of convergence. A priori knowledge of a lower bound on the smallest eigenvalue of the Hessian matrix is avoided. The asymptotic mean squared error of the weighted averaging algorithm is the same as would emerge using a Newton-type adaptive algorithm. Several different gradient estimates are considered; one of them leads to a vanishing asymptotic bias. This gradient estimate applied with the weighted averaging algorithm usually yields a better asymptotic mean squared error than applied with the standard algorithm.
منابع مشابه
Confidence Interval Estimation of the Mean of Stationary Stochastic Processes: a Comparison of Batch Means and Weighted Batch Means Approach (TECHNICAL NOTE)
Suppose that we have one run of n observations of a stochastic process by means of computer simulation and would like to construct a condifence interval for the steady-state mean of the process. Seeking for independent observations, so that the classical statistical methods could be applied, we can divide the n observations into k batches of length m (n= k.m) or alternatively, transform the cor...
متن کاملNon-linear stochastic inversion of regional Bouguer anomalies by means of Particle Swarm Optimization: Application to the Zagros Mountains
Estimating the lateral depth variations of the Earth’s crust from gravity data is a non-linear ill-posed problem. The ill-posedness of the problem is due to the presence of noise in the data, and also the non-uniqueness of the problem. Particle Swarm Optimization (PSO) is a stochastic population-based optimizer, originally inspired by the social behavior of fish schools and bird flocks. PSO is ...
متن کاملCombination of Approximation and Simulation Approaches for Distribution Functions in Stochastic Networks
This paper deals with the fundamental problem of estimating the distribution function (df) of the duration of the longest path in the stochastic activity network such as PERT network. First a technique is introduced to reduce variance in Conditional Monte Carlo Sampling (CMCS). Second, based on this technique a new procedure is developed for CMCS. Third, a combined approach of simulation and ap...
متن کاملAPPROXIMATION OF STOCHASTIC PARABOLIC DIFFERENTIAL EQUATIONS WITH TWO DIFFERENT FINITE DIFFERENCE SCHEMES
We focus on the use of two stable and accurate explicit finite difference schemes in order to approximate the solution of stochastic partial differential equations of It¨o type, in particular, parabolic equations. The main properties of these deterministic difference methods, i.e., convergence, consistency, and stability, are separately developed for the stochastic cases.
متن کاملApproximation of stochastic advection diffusion equations with finite difference scheme
In this paper, a high-order and conditionally stable stochastic difference scheme is proposed for the numerical solution of $rm Ithat{o}$ stochastic advection diffusion equation with one dimensional white noise process. We applied a finite difference approximation of fourth-order for discretizing space spatial derivative of this equation. The main properties of deterministic difference schemes,...
متن کامل